A First-Order Calculus for Allegories

نویسندگان

  • Bahar Aameri
  • Michael Winter
چکیده

In this paper we a language and first-order calculus for formal reasoning about relations based on the theory of allegories. Since allegories are categories the language is typed in Church-style. We show soundness and completeness of the calculus and demonstrate its usability by presenting the RelAPS system; a proof assistant for relational categories based on the calculus presented here.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Allegory of E-Relations in Constructive Type Theory

This paper presents a rst step in the formalisation of a relational calculus inside a constructive type theoretic framework. The calculus is the one based on allegories, and its formalisation is carried on with the help of a software tool assistant for Martin-LL of's monomorphic type theory. The goal of this eeort is allowing us to import relational calculus inside type theory, and take advanta...

متن کامل

SLIDING MODE CONTROL BASED ON FRACTIONAL ORDER CALCULUS FOR DC-DC CONVERTERS

The aim of this paper is to design a Fractional Order Sliding Mode Controllers (FOSMC)for a class of DC-DC converters such as boost and buck converters. Firstly, the control lawis designed with respect to the properties of fractional calculus, the design yields an equiv-alent control term with an addition of discontinuous (attractive) control law. Secondly, themathematical proof of the stabilit...

متن کامل

A Categorical Model for Higher Order Imperative Programming

The order-enriched category of monotonic predicate transformers over posets is a model of the reenement calculus of higher order imperative programs and pre-post speciications. This category is shown to be equivalent to the category of spans over ideal relations, and ideal relations are shown to be spans over monotonic functions between posets, using a skew span construction because the standar...

متن کامل

Decidability of the equational theory of allegories

Freyd and Scedrov showed that the equational theory of representable allegories (essentially those allegories which have a settheoretic representation as relations) is decidable. This paper proves that the pure equational theory of allegories is decidable.

متن کامل

Allegory: Structure, Interpretation and Polysemy

In allegories polysemy relates not only to the context and the audience’s understanding but also to the structural characters of these texts. This paper investigates the function of structural and narrative properties in the creation of multiple interpretations of an allegory. Focusing on the events and following a unique story-line is the most important trait in helping to read the alleg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011